Modal Predicates

نویسندگان

  • Greg Restall
  • Andrea Iacona
چکیده

Despite the wide acceptance of standard modal logic, there has always been a temptation to think that ordinary modal discourse may be correctly analyzed and adequately represented in terms of predicates rather than in terms of operators. The aim of the formal model outlined in this paper is to capture what I take to be the only plausible sense in which ‘possible’ and ‘necessary’ can be treated as predicates. The model is built by enriching the language of standard modal logic with a quantificational apparatus that is “substitutional” rather than “objectual”, and by obtaining from the language so enriched another language in which constants for such predicates apply to singular terms that stand for propositions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nominalizations: The Case of Nominalizations of Modal Predicates

Nominalizations describing events and tropes have a received considerable interest in the semantic (and philosophical) literature. By contrast, nominalizations of modal predicates and the modal objects they describe have received little, if any, attention in the literature so far. This paper is a case study of nominalizations of the sort need and possibility as well as permission, obligation, i...

متن کامل

Line-Based Affine Reasoning in Euclidean Plane

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P ] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decid...

متن کامل

Reasoning about negligibility and proximity

In this paper, we consider the binary relations of negligibility, comparability and proximity in the set of all hyperreals. Associating with them the binary predicates N , C and P and the operators [N ], [C] and [P ], we consider a first-order theory based on these predicates and a modal logic based on these operators. We investigate the axiomatization/completeness and the decidability/complexi...

متن کامل

The Knowability Argument and the Syntactic Type-Theoretic Approach

Recently, there have been some attempts to block the Knowability Paradox and other modal paradoxes by adopting a type-theoretic framework in which knowledge and necessity are regarded as typed predicates. The main problem with this approach is that when these notions are simultaneously treated as predicates, a new kind of paradox appears. I claim that avoiding this paradox either by weakening t...

متن کامل

An overview of Interpretability Logic

A miracle happens In one hand we have a class of marvelously complex theories in predicate logic theories with su cient coding potential like PA Peano Arithmetic or ZF Zermelo Fraenkel Set Theory In the other we have certain modal propositional theories of striking simplicity We translate the modal operators of the modal theories to certain speci c xed de ned predicates of the predicate logical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004